A Library of Algorithms for Graph Drawing

Agd{library: a Library of Algorithms for Graph Drawing 1

A graph drawing algorithm produces a layout of a graph in two-or three-dimensional space that should be readable and easy to understand. Since the aesthetic criteria diier from one application area to another, it is unlikely that a deenition of the \optimal drawing" of a graph in a strict mathematical sense exists. A large number of graph drawing algorithms taking different aesthetic criteria i...

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

AGD: A Library of Algorithms for Graph Drawing

Higres - Visualization System for Clustered Graphs and Graph Algorithms

We present the Higres system – a visualization tool, an editor for clustered graphs and a platform for execution and animation of graph algorithms. Higres can handle any attributed graphs and perform animated semantic processing of them. The semantics of a graph can be defined by the user in the graph editor. The user can also create new external modules to process graphs with defined semantics...

Algorithmic Patterns for Orthogonal Graph Drawing

In this paper, we present an object-oriented design and implementation of the core steps of the giotto algorithm for orthogonal graph drawing. Our design is motivated by the goals of making the algorithm modular and extensible and of providing many reusable components of the algorithm. This work is part of the jdsl project aimed at creating a library of data structures and algorithms in Java.